Linearized trinomials with maximum kernel

نویسندگان

چکیده

Linearized polynomials have attracted a lot of attention because their applications in both geometric and algebraic areas. Let q be prime power, n positive integer σ generator Gal(Fqn:Fq). In this paper we provide closed formulas for the coefficients σ-trinomial f over Fqn which ensure that dimension kernel equals its σ-degree, is linearized with maximum kernel. As consequence, present explicit examples trinomials characterize those having σ-degree 3 4. Our techniques rely on tools developed [24]. Finally, apply these results to investigate class rank metric codes introduced [8], construct quasi-subfield cyclic subspace codes, obtaining new constructions conjecture posed [37].

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kernel recursive maximum correntropy

Zongze Wu 1 , Jiahao Shi 1 , Xie Zhang 1 , Wentao Ma 2 , Badong Chen 2* , Senior Member, IEEE 1. School of Electronic and Information Engineering, South China University of Technology, Guangzhou, 510640, China 2. School of Electronic and Information Engineering, Xi’an Jiaotong University, Xi’an, 710049, China * Fax: 86-29-82668672,Tel:86-29-82668802 ext. 8009, [email protected] Abstract—I...

متن کامل

Maximum Kernel Likelihood Estimation

We introduce an estimator for the population mean based on maximizing likelihoods formed by parameterizing a kernel density estimate. Due to these origins, we have dubbed the estimator the maximum kernel likelihood estimate (mkle). A speedy computational method to compute the mkle based on binning is implemented in a simulation study which shows that the mkle at an optimal bandwidth is decidedl...

متن کامل

Maximum likelihood kernel density estimation

Methods for improving the basic kernel density estimator include variable locations, variable bandwidths (often called variable kernels) and variable weights. Currently these methods are implemented separately and via pilot estimation of variation functions derived from asymptotic considerations. In this paper, we propose a simple maximum likelihood procedure which allows (in its greatest gener...

متن کامل

Root Separation for Trinomials

We give a separation bound for the complex roots of a trinomial f ∈ Z[X ]. The logarithm of the inverse of our separation bound is polynomial in the size of the sparse encoding of f ; in particular, it is polynomial in log(deg f). It is known that no such bound is possible for 4-nomials (polynomials with 4 monomials). For trinomials, the classical results (which are based on the degree of f rat...

متن کامل

Kernel Maximum a Posteriori Classification with Error Bound Analysis

Kernel methods have been widely used in data classification. Many kernel-based classifiers like Kernel Support Vector Machines (KSVM) assume that data can be separated by a hyperplane in the feature space. These methods do not consider the data distribution. This paper proposes a novel Kernel Maximum A Posteriori (KMAP) classification method, which implements a Gaussian density distribution ass...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 2022

ISSN: ['1873-1376', '0022-4049']

DOI: https://doi.org/10.1016/j.jpaa.2021.106842